DIE MAXIMALZAHL VON KREUZUNGSFREIEN KANTEN IN DARSTELLUNGEN VON VOLLSTAENDIGEN N-GETEILTEN GRAPHEN = LE NOMBRE MAXIMUM D'ARETES SANS CROISEMENT DANS LE TRACAGE DE GRAPHES N-PARTIS COMPLETSMENGERSEN I.1978; MATH. NACHR.; DDR; DA. 1978; VOL. 85; PP. 131-139; BIBL. 5 REF.Article

EDGES WITHOUT CROSSINGS IN DRAWINGS OF COMPLETE GRAPHS.HARBORTH H; MENGERSEN I.1974; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1974; VOL. 17; NO 3; PP. 299-311; BIBL. 4 REF.Article

GENERALIZED RAMSEY THEORY FOR GRAPHS. XII: BIPARTITE RAMSEY SETSHARARY F; HARBORTH H; MENGERSEN I et al.1981; GLASG. MATH. J.; ISSN 0017-0895; GBR; DA. 1981; VOL. 22; NO 1; PP. 31-41; BIBL. 7 REF.Article

An upper bound for the Ramsey number r(K₅-e)HARBORTH, H; MENGERSEN, I.Journal of graph theory. 1985, Vol 9, Num 4, pp 483-485, issn 0364-9024Article

Point sets with many units circlesHARBORTH, H; MENGERSEN, I.Discrete mathematics. 1986, Vol 60, pp 193-197, issn 0012-365XArticle

The ramsey number of K₅-eCLAPHAM, C; EXOO, G; HARBORTH, H et al.Journal of graph theory. 1989, Vol 13, Num 1, pp 7-15, issn 0364-9024Article

Matching-star Ramsey setsMENGERSEN, I; OECKERMANN, J.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 417-424, issn 0166-218XConference Paper